Labels:text | screenshot | font OCR: As an extension to the dialect of SCHEME described in [?], T does not restrict the value expressions to be LAMBI (LABELS ((A (LAMBDA (X) (+ X B))) (B 1)) . body) which can also be written (LABELS (((A X) (+ X B)) (B 1)). body) the value of B is not used before body is evaluated. The LAMBDA-expression evaluates to a closure that includes LABELS cannot easily be described in terms of LAMBDA. However, it can be described in terms of LAMBDA and (LABELS ((varı val₁) (var2 val2) (varn valn)) body) = (LET ((var1 (UNDEFINED-VALUE)) (var2 (UNDEFINED-VALUE)) (varn (UNDEFINED-VALUE))) (SET var₁ val₁) (SET var2 val2) (SET varn valn) body) This equivalence is overly concrete in that the order of evaluation of the val; expressions, and the sequence in which
